Worst Case Analysis of Forward Wagner Whitin Algorithm with Rolling Horizons

نویسنده

  • Tianbing Qian
چکیده

In this paper, we analyze the performance guarantee of the forward Wagner-Whitin algorithm with rolling horizons. We establish several properties for the solution returned by the algorithm and show that the ratio of the heuristic solution to the optimal cost is bounded above by the degree of speculative motive. Further, we show that the bound is actually tight.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

cient and Stable Heuristics For Lot SizingProblems With Variable Unit

We present lot-sizing heuristics that are both e cient and stable for the dynamic lot-sizing problem(DLSP) with constant or variable unit costs, including setup, inventory holding and production costs. These heuristics are myopic variants of the forward Wagner-Whitin algorithm with rolling horizons. Large scale computational experiments show that these heuristics considerably outperform other w...

متن کامل

Robust Wagner–Whitin algorithm with uncertain costs

In real-world applications, costs for products are not deterministic: neither static nor dynamic. They actually tend to be non-stationary and cross-correlated. To overcome this drawback, there have been some efforts by researchers to extend the Wagner–Whitin algorithm to consider stochastic costs. However, they assume that the information of probability density function of random costs exists. ...

متن کامل

An Improved WAGNER-WHITIN Algorithm

We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model ...

متن کامل

Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics

In this paper we analyze the worst case performance of heuristics for the classical economic lot-sizing problem with time-invariant cost parameters. We consider a general class of on-line heuristics that is often applied in a rolling horizon environment. We develop a procedure to systematically construct worst case instances for a fixed time horizon and use it to derive worst case problem insta...

متن کامل

Sensitivity Analysis of the Economic Lot-Sizing Problem

In this paper we study sensitivity analysis of the uncapacitated single level economic lot-sizing problem, which was introduced by Wagner and Whitin about thirty years ago. In particular we are concerned with the computation of the maximal ranges in which the numerical problem parameters may vary individually, such that a solution already obtained remains optimal. Only recently it was discovere...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996